Semantics of nondeterminism, concurrency, and communication
نویسندگان
چکیده
منابع مشابه
A Mathematical Game Semantics of Concurrency and Nondeterminism
Concurrent games as event structures form a partial order model of concurrency where concurrent behaviour is captured by nondeterministic concurrent strategies—a class of maps of event structures. Extended with winning conditions, the model is also able to give semantics to logics of various kinds. An interesting subclass of this game model is the one considering deterministic strategies only, ...
متن کاملTesting Semantics for Unbounded Nondeterminism
We present an extension of the classical testing semantics for the case when nondeterminism is unbounded. We deene the corresponding may and must preorders in the new framework. As in the bounded setting the may preorder can be characterized by using the set of nite traces of processes. On the contrary, in order to characterize the must preorder is necessary to record some additional informatio...
متن کاملContinuation Semantics for Concurrency with Multiple Channels Communication
In this paper we investigate the formal design of concurrent languages based on the concept of continuation. We present a denotational approach of concurrent programs by using continuations for concurrency. We illustrate the approach by designing a continuation semantics for a language with nondeterministic choice, sequential and parallel composition, and a mechanism of communication and synchr...
متن کاملProbability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our survey is carried out from the perspective of probabilistic automata, a model originally developed for the analysis of randomized distributed algorithms.
متن کاملSAT-based planning in complex domains: Concurrency, constraints and nondeterminism
Planning as satisfiability is a very efficient technique for classical planning, i.e., for planning domains in which both the effects of actions and the initial state are completely specified. In this paper we present C-SAT, a SAT-based procedure capable of dealing with planning domains having incomplete information about the initial state, and whose underlying transition system is specified us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90006-0